A Note on Invariant Temporal Functions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the bounds of Laplacian-energy-like-invariant

The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...

متن کامل

A Note on the Invariant

In this note we analyse the Exceptional Component of the space of integrable forms of degree two, introduced by Cerveau-Lins Neto, in terms of the geometry of Veronese curves and classical invariant theory.

متن کامل

A Note on Invariant Measures

The aim of the paper is to show that if F is a family of continuous transformations of a nonempty compact Hausdorff space Ω, then there is no F-invariant probabilistic regular Borel measures on Ω iff there are φ1, . . . , φp ∈ F (for some p ≥ 2) and a continuous function u : Ω → R such that P σ∈Sp u(xσ(1), . . . , xσ(p)) = 0 and lim infn→∞ 1 n Pn−1 k=0 (u ◦ Φ )(x1, . . . , xp) ≥ 1 for each x1, ...

متن کامل

A Note on Invariant Finitely Additive Measures

We show that under certain general conditions any finitely additive measure which is defined for all subsets of a set X and is invariant under the action of a group G acting on X is concentrated on a G-invariant subset Y on which the G-action factors to that of an amenable group. The result is then applied to prove a conjecture of S. Wagon about finitely additive measures on spheres. It is well...

متن کامل

A Note on Invariant Random Variables

One method of improving safety of transmissions between simple sensing devices is to assign sets of cryptographic keys to them. Methods of distributions of such keys are called key predistribution schema. The basic probabilistic key predistribution schema from Eschenauer and Gligor (2002) can be described as follows: we have a pool K of cryptographic symmetric keys of cardinality n; each device...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Letters in Mathematical Physics

سال: 2016

ISSN: 0377-9017,1573-0530

DOI: 10.1007/s11005-016-0850-x